package leetcode.f1t100;

/**
 * 从M*N矩阵左上走到右下(只能向右或向下)共有多少种方式
 * https://leetcode.com/problems/unique-paths/
 *
 * @Author lichongxiao
 * @Date 2022/10/25 16:55
 */
public class Q62_UniquePaths {
    public int uniquePaths(int m, int n) {
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++) {
            dp[i][0] = 1;
        }
        for (int i = 0; i < n; i++) {
            dp[0][i] = 1;
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m - 1][n - 1];
    }
}
